Lot Sizing with Piecewise Concave Production Costs
نویسندگان
چکیده
We study the lot-sizing problem with piecewise concave production costs and concave holding costs. This problem is a generalization of the lot-sizing problem with quantity discounts, minimum order quantities, capacities, overloading, subcontracting or a combination of these. We develop a dynamic programming (DP) algorithm to solve this problem and answer an open question in the literature: we show that the problem is polynomially solvable when the breakpoints of the production cost function are time invariant and the number of breakpoints is fixed. For the special cases with capacities and subcontracting, the time complexity of our DP algorithm is as good as the complexity of algorithms available in the literature. We report the results of a computational experiment where the DP is able to solve instances that are hard for a mixed-integer programming (MIP) solver. We enhance the MIP formulation with valid inequalities based on mixing sets and use a cut-and-branch algorithm to compute better bounds. We propose a state space reduction based heuristic algorithm for large ∗Corresponding author
منابع مشابه
A Polynomial Algorithm for the Multi-Stage Production-Capacitated Lot-Sizing Problem
The multi-stage lot-sizing problem with production capacities (MLSP-PC) deals with a supply chain that consists of a manufacturer with stationary production capacity and intermediaries (distribution centers or wholesalers) and a retailer to face deterministic demand. An optimal supply chain plan for the MLSP-PC specifies when and how many units each organization of the supply chain has to produ...
متن کاملWorking Paper MASSACHUSETTS INSTITUTE OF TECHNOLOGY by Separable Concave Optimization Approximately Equals Piecewise Linear Optimization
Consider a separable concave minimization problem with nondecreasing costs over a general ground set X ⊆ R+. We show how to efficiently approximate this problem to a factor of 1+2 in optimal cost by a single piecewise linear minimization problem over X. The number of pieces is linear in 1/2 and polynomial in the logarithm of certain ground set parameters; in particular, it is independent of the...
متن کاملOPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملBasis Paths and a Polynomial Algorithm for the Multistage Production-Capacitated Lot-Sizing Problem
We consider the multilevel lot-sizing problem with production capacities (MLSP-PC), in which production and transportation decisions are made for a serial supply chain with capacitated production and concave cost functions. Existing approaches to the multistage version of this problem are limited to nonspeculative cost functions—up to now, no algorithm for the multistage version of this model w...
متن کاملMultiechelon Lot Sizing: New Complexities and Inequalities
We study a multiechelon supply chain model that consists of a production level and several transportation levels, where the demands can exist in the production echelon as well as any transportation echelons. With the presence of stationary production capacity and general cost functions, our model integrates production, inventory and transportation decisions and generalizes existing literature o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- INFORMS Journal on Computing
دوره 26 شماره
صفحات -
تاریخ انتشار 2014